Timing-Based Communication Refinement for CFSMs

نویسنده

  • Heloise Hse
چکیده

In this paper, we present an approach to refine the communication mechanism of CFSMs. Currently, CFSMs communicate via one-place buffer using nonblocking write semantics. If sending events arrive faster than the receiving module can consume, some events may be lost. This is clearly undesirable especially when the events are critical. Using a rendezvous-based mechanism for communication as our starting point, we transform rendezvous points into bounded buffers whenever possible. An algorithm for sizing buffers is presented taking into consideration of the possibility of CPU contention when several processes are sharing a CPU.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchy - Based Incremental Deadlock Detection for

In this paper, we consider communication protocols modeled as sets of communicating finite state machines (CFSM) with synchronous communication. For a set M of CFSMs, reachability analysis of M is to derive a composite CFSM describing the behavior of M and verify safety properties such as freedom from deadlocks or livelocks. The conventional approach to reachability analysis of M is to compose ...

متن کامل

A Tool for Choreography-Based Analysis of Message-Passing Software

An appealing characteristic of choreographies is that they provide two complementary views of communicating software: the global and the local views. Communicating finite-state machines (CFSMs) have been proposed as an expressive formalism to specify local views. Global views have been represented with global graphs, that is graphical choreographies (akin to BPMN and UML) suitable to represent ...

متن کامل

Multiparty Session Types Meet Communicating Automata

Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in characterising essential properties of communications such as freedom from deadlock and communication error, and buffer boundedness. CFSMs are known to be computationally hard: most of these properties are undecidable even in r...

متن کامل

Input Sequence Generation for Testing of Communicating Finite State Machines (CFSMs)

Finite State Machines (FSMs) have been used to model systems in different areas like sequential circuits, software development and communication protocols [1]. FSMs have been an effective method of modelling because a variety of techniques and automated tools exist that work with them. Testing is an important part of the software engineering process and can account for up to 50% of the total co...

متن کامل

Designing wireless protocols: methodology and applications

Communication protocols are essential components of wireless systems. Present methods for protocol design are heuristic in nature and are not suited for next generation wireless systems where time-to-market concerns require correct-the-first-time implementations. In this paper we present a new design methodology for wireless protocols based on the principle of orthogonalization of concerns. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998